Heuristics for the traveling purchaser problem
نویسندگان
چکیده
This article deals with two versions of the traveling purchaser problem. In the uncapacitated version, the number of units of a given product available at any market where it is sold is either larger than or equal to the demand. In the capacitated version, the availability may be smaller than the demand. This study extends some known heuristics and presents some new ones capable of solving either version of the problem. The new heuristics are compared to each other and to some previous heuristics. Computational results con5rm the quality of the proposed heuristics. Scope and purpose In the traveling purchaser problem an agent must visit a set of outlets in order to satisfy at minimum cost demand requirement for given products. The cost is made up of two elements: travel cost between markets and purchase cost. This problem is frequently faced by shoppers but it also has applications in the area of production scheduling. Since it is hard to solve to optimality, the authors propose e8cient heuristics capable of producing near-optimal solutions. ? 2002 Elsevier Science Ltd. All rights reserved.
منابع مشابه
Approximation Algorithms for the Traveling Purchaser Problem and its Variants in Network Design
The traveling purchaser problem is a generalization of the traveling salesman problem with applications in a wide range of areas including network design and scheduling The input consists of a set of markets and a set of products Each market o ers a price for each product and there is a cost associated with traveling from one market to another The problem is to purchase all products by visiting...
متن کاملA Dynamic Programming Approach for a Travelling Purchaser Problem With Additional Constraints
The traveling purchaser problem (TPP) is the problem of determining a tour of a purchaser that needs to buy several items in different shops such that the total amount of travel and purchase costs is minimized. We study a version of the problem with additional constraints, namely, a limit on the maximum number of markets to be visited, a limit on the number of items bought per market and where ...
متن کاملDistributed Parallel Metaheuristics based on GRASP and VNS for Solving the Traveling Purchaser Problem
We intend to show in this paper that metaheuristics based on GRASP and VNS can give good results for a generalization of the Traveling Salesman Problem (TSP) called Traveling Purchaser Problem (TPP) when compared with the Tabu Search algorithm proposed by Voss [13] for this algorithm, concerning the quality of solutions in similar execution times. In these algorithms, several simple and well kn...
متن کاملApproximation Algorithms for the TravelingPurchaser Problem and its Variants in
The traveling purchaser problem is a generalization of the traveling salesman problem with applications in a wide range of areas including network design and scheduling. The input consists of a set of markets and a set of products. Each market ooers a price for each product and there is a cost associated with traveling from one market to another. The problem is to purchase all products by visit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & OR
دوره 30 شماره
صفحات -
تاریخ انتشار 2003